Priority and Maximal Progress Are Completely Axioatisable (Extended Abstract)

During the last decade, CCS has been extended in different directions, among them priority and real time. One of the most satisfactory results for CCS is Milner’s complete proof system for observational congruence [?]. Observational congruence is fair in the sense that it is possible to escape divergence, reflected by an axiom recX.(τ.X + P ) = recX.τ.P . In this paper we discuss observational congruence in the context of interactive Markov chains, a simple stochastic timed variant CCS with maximal progress. This property implies that observational congruence becomes unfair, i.e. it is not always possible to escape divergence. This problem also arises in calculi with priority. So, completeness results for such calculi modulo observational congruence have been unknown until now. We obtain a complete proof system by replacing the above axiom by a set of axioms allowing to escape divergence by means of a silent alternative. This treatment can be profitably adapted to other calculi.